An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank
نویسنده
چکیده
ω-powers of finitary languages are ω-languages in the form V , where V is a finitary language over a finite alphabet Σ. Since the set Σ of infinite words over Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers naturally arises and has been raised by Niwinski [Niw90], by Simonnet [Sim92], and by Staiger [Sta97b]. It has been proved in [Fin01] that for each integer n ≥ 1, there exist some ω-powers of context free languages which are Πn-complete Borel sets, and in [Fin03] that there exists a context free language L such that L is analytic but not Borel. But the question was still open whether there exists a finitary language V such that V ω is a Borel set of infinite rank. We answer this question in this paper, giving an example of a finitary language whose ω-power is Borel of infinite rank.
منابع مشابه
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
ω-powers of finitary languages are ω-languages in the form V , where V is a finitary language over a finite alphabet Σ. Since the set Σ of infinite words over Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers naturally arises and has been raised by Niwinski [Niw90], by Simonnet [Sim92], and by Staiger [Sta97b]. It has been proved in [Fin01]...
متن کاملThere Exist Some omega -Powers of Any Borel Rank
The operation V → V ω is a fundamental operation over finitary languages leading to ω-languages. Since the set Σ of infinite words over a finite alphabet Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers of finitary languages naturally arises and has been posed by Niwinski [Niw90], Simonnet [Sim92] and Staiger [Sta97a]. It has been recently...
متن کاملen sl - 0 01 57 20 4 , v er si on 1 - 2 5 Ju n 20 07 There exist some ω - powers of any Borel rank
The operation V → V ω is a fundamental operation over finitary languages leading to ω-languages. Since the set Σ of infinite words over a finite alphabet Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers of finitary languages naturally arises and has been posed by Niwinski [Niw90], Simonnet [Sim92] and Staiger [Sta97a]. It has been recently...
متن کاملAn omega-power of a context-free language which is Borel above Delta^0_omega
We use erasers-like basic operations on words to construct a set that is both Borel and above ∆0ω , built as a set V ω where V is a language of finite words accepted by a pushdown automaton. In particular, this gives a first example of an ω-power of a context free language which is a Borel set of infinite rank.
متن کاملBorel hierarchy and omega context free languages
We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:”A Decade of Concurrency”, Springer LNCS 803 (1994), 583-621], proving topological properties of omega context free languages (ω-CFL) which extend those of [O. Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Vol. 262 (1-2),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 62 شماره
صفحات -
تاریخ انتشار 2004